A Fast Algorithm for Computing Longest Common Subsequences
نویسندگان
چکیده
References 1. Benner, F.H. On designing generalized file records for management information systems. Proc. AFIPS 1967 FJCC, Vol. 31, AFIPS Press, Montvale, N.J., pp. 291-303. 2. Burroughs DISK FORTE Users Manual. Burroughs Corp., Detroit, Mich., 1973. 3. Collmeyer, A.J., and Shemer, J.E. Analysis of retrieval performance for selected file organization techniques. Proc. AFIPS 1970 FJCC, Vol. 37, pp. 201-210. 4. Olle, T.W. Generalized systems for storing structured variable length data and retrieving information. In Mechanized Information Storage, Retrieval and Dissemination, K. Samuelson, Ed., Rome, 1968. 5. Wilde, D.J., and Beighfler, C.S. Foundations of Optimization. Prentice-Hall, Englewood Cliffs, N.J., 1967.
منابع مشابه
A Greedy Approach for Computing Longest Common Subsequences
This paper presents an algorithm for computing Longest Common Subsequences for two sequences. Given two strings X and Y of length m and n, we present a greedy algorithm, which requires O(n log s) preprocessing time, where s is distinct symbols appearing in string Y and O(m) time to determines Longest Common Subsequences.
متن کاملFACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search
Searching for the multiple longest common subsequences MLCS has significant applications in the areas of bioinformatics, information processing, and data mining, and so forth, Although a few parallel MLCS algorithms have been proposed, the efficiency and effectiveness of the algorithms are not satisfactory with the increasing complexity and size of biologic data. To overcome the shortcomings of...
متن کاملComputing the Number of Longest Common Subsequences
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
متن کاملA linear space algorithm for computing a longest common increasing subsequence
Let X and Y be sequences of integers. A common increasing subsequence of X and Y is an increasing subsequence common to X and Y . In this note, we propose an O(|X| · |Y |)-time and O(|X| + |Y |)-space algorithm for finding one of the longest common increasing subsequences of X and Y , which improves the space complexity of Yang et al. [I.H. Yang, C.P. Huang, K.M. Chao, A fast algorithm for comp...
متن کاملA New Family of String Classifiers Based on Local Relatedness
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr’s), longest common subsequences (LCSeq’s), and window-accumulated longest common subsequences (wLCSeq’s). We show that finding the optimal classier for given two sets of strings (the positive set and the negative set)...
متن کاملA Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple Strings
Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many applications in the areas of bioinformatics and computational genomics. Although significant efforts have been made to address the problem and its special cases, the increasing complexity and size of biological data require more efficient methods applicable to an arbitrary number of strings. In thi...
متن کامل